Quantum Computation of Jones’ Polynomials
نویسنده
چکیده
It is one of the challenging problems to construct an efficient quantum algorithm which can compute the Jones’ polynomial for any knot or link obtained from closure or capping of a n-strand braid. We recapitulate the construction of braid-group Bn representations from vertex models. We perform orthogonal transformation involving quantum Clebsch-Gordan coefficient matrix on the qubit basis to obtain eigen basis for the braiding generators. Using the transformed bases, we propose a quantum algorithm to determine the Jones’ Polynomial for any knot or link.
منابع مشابه
Estimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کاملTopological Quantum Computation
* Copyright (C) 2010: Permission is granted to everyone to make verbatim copies of this document provided that the copyright notice and this permission notice are preserved. Synopsis • Introduction to anyons and topological models Anyons, their properties and their relation to topological quantum computation. • Quantum double models Quantum double models are stabilizer codes, that can be descri...
متن کاملOn the Complexity of Random Quantum Computations and the Jones Polynomial
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations of Jones polynomials can be used to bound the classical complexity of approximately simulating random quantum computations. We prove that random quantum computations cannot be classically simulated up to a constant to...
متن کاملEstimating Jones polynomials is a complete problem for one clean qubit
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model[12, 3, 1]. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be stri...
متن کاملThe Non-commutative A-polynomial of Twist Knots
The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative A-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of the form J(n) = P k c(n, k)Ĵ(k) given a recursion relation for (Ĵ(n)) a the hyp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002